Number 4

نویسندگان

  • Syed Mohammad Ali
  • Pradeep Tulshiram Karule
چکیده

In this research work, normal & vocal cord cancer voice samples are used & a system is designed to classify vocal cord cancer speech from Normal speech. Vocal cord carcinoma is defined as a malignant tumor in the vocal fold. It is a form of laryngeal cancer, also called as glottis cancer. Pre-processed diseased and normal speech signals are used for spectral analysis to detect disease. Autocorrelation of speech signals is calculated to see the difference between normal and vocal cord cancer speech signal. Two sets of twenty five features are calculated and three neural networks like MLP, GFF, Modular and SVM are used for classification. Feature sets, Networks with highest classification accuracy were found. It is observed that the accuracy of this disease classification is 100%.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

4-Holes in point sets

We consider a variant of a question of Erdős on the number of empty k-gons (k-holes) in a set of n points in the plane, where we allow the k-gons to be non-convex. We show bounds and structural results on maximizing and minimizing the number of general 4-holes, and maximizing the number of non-convex 4-holes. In particular, we show that for n ≥ 9, the maximum number of general 4-holes is ( n 4 ...

متن کامل

Counting 2-Connected 4-Regular Maps on the Projective Plane

In this paper the number of rooted (near-) 4-regular maps on the projective plane are investigated with respect to the root-valency, the number of edges, the number of inner faces, the number of nonroot-vertex-loops, the number of nonroot-vertexblocks. As special cases, formulae for several types of rooted 4-regular maps such as 2-connected 4-regular projective planar maps, rooted 2-connected (...

متن کامل

The crossing number of the strong product of two paths

Let Pm Pn be the strong product of two paths Pm and Pn. In 2013, Klešč et al. conjectured that the crossing number of Pm Pn is equal to (m − 1)(n − 1) − 4 for m ≥ 4 and n ≥ 4. In this paper we show that the above conjecture is true except when m = 4 and n = 4, and that the crossing number of P4 P4 is four.

متن کامل

Avoidance colourings for small nonclassical Ramsey numbers

The irredundant Ramsey number s = s(m,n) [upper domination Ramsey number u = u(m,n), respectively] is the smallest natural number s [u, respectively] such that in any red-blue edge colouring (R,B) of the complete graph of order s [u, respectively], it holds that IR(B) ≥ m or IR(R) ≥ n [Γ(B) ≥ m or Γ(R) ≥ n, respectively], where Γ and IR denote respectively the upper domination number and the ir...

متن کامل

Charting the role of the number line in mathematical development

Individuals who do well in mathematics and science also often have good spatial skills. However, the predictive direction of links between spatial abilities and mathematical learning has not been firmly established, especially for young children. In the present research, we addressed this issue using a sample from a longitudinal data set that spanned 4 years and which includes measures of mathe...

متن کامل

N ov 2 00 4 THE NUMBER OF S 4 FIELDS WITH GIVEN DISCRIMINANT

We prove that the number of S 4-extensions of the rationals of given discriminant d is O(d 1/2+ǫ) for all ǫ > 0. For a prime number C we derive that the number of octahedral modular forms of weight 1 and conductor C is bounded above by O(C 1/2 log(C) 2).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017